A semi-recursion for the number of involutions in special orthogonal groups over finite fields

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A semi-recursion for the number of involutions in special orthogonal groups over finite fields

Let I(n) be the number of involutions in a special orthogonal group SO(n,Fq) defined over a finite field with q elements, where q is the power of an odd prime. Then the numbers I(n) form a semi-recursion, in that for m > 1 we have I(2m+ 3) = (q + 1)I(2m+ 1) + q(q − 1)I(2m− 2). We give a purely combinatorial proof of this result, and we apply it to give a universal bound for the character degree...

متن کامل

Asymptotics of the Number of Involutions in Finite Classical Groups

Answering a question of Geoff Robinson, we compute the large n limiting proportion of i(n, q)/qbn 2/2c, where i(n, q) denotes the number of involutions in GL(n, q). We give similar results for the finite unitary, symplectic, and orthogonal groups, in both odd and even characteristic. At the heart of this work are certain new “sum=product” identities. Our self-contained treatment of the enumerat...

متن کامل

Special Involutions and Bulky Parabolic Subgroups in Finite Coxeter Groups

In [3] Felder and Veselov considered the standard and twisted actions of a finite Coxeter group W on the cohomology H(MW ) of the complement of the complexified hyperplane arrangement MW of W . The twisted action is obtained by combining the standard action with complex conjugation; we refer the reader to [3] for precise statements. In a case by case argument, Felder and Veselov obtain a formul...

متن کامل

Explicit formulas for monomial involutions over finite fields

Francis Castro, Carlos Corrada, Natalia Pacheco∗, Ivelisse Rubio, University of Puerto Rico, Ŕıo Piedras Permutations of finite fields have important applications in cryptography and coding theory. Involutions are permutations that are its own inverse and are of particular interest because the implementation used for coding can also be used for decoding. We present explicit formulas for all the...

متن کامل

Heisenberg groups over finite fields

ing this computation, for given k-vectorspace V with non-degenerate alternating form 〈, 〉, put a Lie algebra [2] structure h on V ⊕ k by Lie bracket [v ⊕ z, v′ ⊕ z′] = 0⊕ 〈v, v′〉 In exponential coordinates on H, the exponential map h→ H with H ≈ V ⊕ k is notated exp(v ⊕ z) = v ⊕ z with Lie group structure on H by (v ⊕ z) · (v′ ⊕ z′) = (v + v′)⊕ (z + z′ + 〈v, v ′〉 2 ) (exponential coordinates in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2011

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2011.03.002